Higher-Order Horn Logic Programming

Higher-order Logic Programming Higher-order Logic Programming Y Contents 1 Introduction 3 2 Motivating a Higher-order Extension to Horn Clauses 5 3 a Higher-order Logic 12

CS - - 1989 - 18 Higher - Order Logic as the Basis for Logic Programming

A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming. In qualitative terms, these higher-order Horn clauses are obtained from the rst-order ones by replacing rst-order terms with simply typed-terms and by permitting quantiication over all occurrences of function symbols and some occurrences of predicate symbols. Several proof-theore...

Abstractions in Logic Programs

ions in Logic Programs Dale Miller University of Pennsylvania Follow this and additional works at: http://repository.upenn.edu/cis_reports University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-89-30. This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis_reports/702 For more information, please contact [email protected]...

Stepwise Enhancement and Higher-Order Programming in Prolog

This paper presents two views of stepwise enhancement, one a pragmatic syntax-based approach and the other a semantic approach based on higher-order functions and relating to shape and polytypism. The approaches are outlined, and the perhaps surprisingly close relationship between the two described. By combining the advantages of both approaches, it is shown how more code in both functional and...

Uniform Proofs as a Foundation for Logic Programming

A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instr...